Monotone Crossing Number
نویسندگان
چکیده
The monotone crossing number of G is defined as the smallest number of crossing points in a drawing of G in the plane, where every edge is represented by an x-monotone curve, that is, by a connected continuous arc with the property that every vertical line intersects it in at most one point. It is shown that this parameter can be strictly larger than the classical crossing number cr(G), but it is bounded from above by 2cr(G). This is in sharp contrast with the behavior of the rectilinear crossing number, which cannot be bounded from above by any function of cr(G).
منابع مشابه
Minor-monotone crossing number
The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mcr for some important graph families using the topological structure of graphs satisfying mcr(G) ≤ k.
متن کاملCrossing Number Is Hard for Cubic Graphs
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP -hard problem. Their reduction, however, used parallel edges and vertices of very high degrees. We prove here that it is NP -hard to determine the crossing number of a simple cubic graph. In particular, this implies that the minor-monotone version of crossing number is also NP -hard, which has been...
متن کاملThe Genus Crossing Number
Pach and Tóth [6] introduced a new version of the crossing number parameter, called the degenerate crossing number, by considering proper drawings of a graph in the plane and counting multiple crossing of edges through the same point as a single crossing when all pairwise crossings of edges at that point are transversal. We propose a related parameter, called the genus crossing number, where ed...
متن کاملMore on the crossing number of Kn: Monotone drawings
The Harary-Hill conjecture states that the minimum number of crossings in a drawing of the complete graph Kn is Z(n) := 1 4 ⌊ n 2 ⌋ ⌊ n−1 2 ⌋ ⌊ n−2 2 ⌋ ⌊ n−3 2 ⌋ . This conjecture was recently proved for 2-page book drawings of Kn. As an extension of this technique, we prove the conjecture for monotone drawings of Kn, that is, drawings where all vertices have different x-coordinates and the edg...
متن کاملThe warping degree of a link diagram
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D in the usual way. We show that d(D) + d(−D) + sr(D) is less than or equal to the crossing number of D, where −D denotes the inverse of D and sr(D) denotes the number of component subdiagrams which have at least one self-crossing. Moreover, we pr...
متن کامل